Breakdowns in the Computation of Orthogonal Polynomials
نویسنده
چکیده
When computingrecursively the members of a family of formal orthogonal polynomials, a division by zero can occur, thus producing a breakdown in the algorithm which has to be stopped. In this paper, such breakdowns are analyzed in detail and classiied. It is also showed how to avoid them in some particular cases. Applications to Pad e approximation, extrapolation methods and Lanczos method for solving systems of linear equations are discussed.
منابع مشابه
Breakdowns in the Implementation of the L Anczos Method for Solving Linear Systems
The LL anczos method for solving systems of linear equations is based on formal orthogonal polynomi-als. Its implementation is realized via some recurrence relationships between polynomials of a family of orthogonal polynomials or between those of two adjacent families of orthogonal polynomials. A division by zero can occur in such recurrence relations, thus causing a breakdown in the algorithm...
متن کاملSolving singular integral equations by using orthogonal polynomials
In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...
متن کاملBuckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries
The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...
متن کاملRecurrences and explicit formulae for the expansion and connection coefficients in series of the product of two classical discrete orthogonal polynomials
Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$ x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x),$$ we find the coefficients $b_{i,j}^{(p,q,ell ,,r)}$ in the expansion $$ x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell }y^{r}f^{(p,q)}(x,y) =sumli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994